The stick number of rail arcs
نویسندگان
چکیده
Consider two parallel lines $\ell_1$ and $\ell_2$ in $\mathbb{R}^3$. A rail arc is an embedding of $\mathbb{R}^3$ such that one endpoint on $\ell_1$, the other $\ell_2$, its interior disjoint from $\ell_1\cup\ell_2$. Rail arcs are considered up to isotopies, ambient isotopies with each self-homeomorphism mapping onto themselves. When manifolds maps taken piecewise linear category, these called stick arcs. The number a class minimum sticks, line segments p.l. arc, needed create representative. This paper will calculate numbers classes crossing at most 2 use winding invariant infinitely many classes. Each has canonically associated knot classes, under over companions. also introduces sticks whose or companion class. calculated for all 9. multi-component as well lattice
منابع مشابه
The Number of Dependent Arcs in an Acyclic Orientation
Let G be a graph with n nodes, e edges, chromatic number and girth g. In an acyclic orientation of G, an arc is dependent if its reversal creates a cycle. It is well known that if < g, then G has an acyclic orientation without dependent arcs. Edelman showed that if G is connected, then every acyclic orientation has at most e ? n + 1 dependent arcs. We show that if G is connected and < g, then G...
متن کاملThe number of pancyclic arcs in a k-strong tournament
A tournament is a digraph, where there is precisely one arc between every pair of distinct vertices. An arc is pancyclic in a digraph D, if it belongs to a cycle of length l, for all 3 <= l <= |V (D)|. Let p(D) denote the number of pancyclic arcs in a digraph D and let h(D) denote the maximum number of pancyclic arcs belonging to the same Hamilton cycle of D. Note that p(D) >= h(D). Moon showed...
متن کاملHamiltonian paths and cycles, number of arcs and independence number in digraphs
Manoussakis, Y. and D. Amar, Hamiltonian paths and cycles, number of arcs and independence number in digraphs, Discrete Mathematics 105 (1992) 157-172. We let D denote a digraph with n vertices, independence number at least (Y and half-degrees at least k. We give (i) a function f(n, a) (respectively f (n, k, a)) such that any digraph with at least f(n, a) (respectively f(n, k, a)) arcs is Hamil...
متن کاملThe Minimum Exponent of the Primitive Digraphs on the given Number of Arcs
Primitive digraphs on n vertices, k arcs and girth s are considered. By a(n, k, s) we mean the minimum exponent taken over all such digraphs. We estimate the number a(n, k, s) using the Frobenius number for special values of k and s.
متن کاملthe effect of taftan pozzolan on the compressive strength of concrete in the environmental conditions of oman sea (chabahar port)
cement is an essential ingredient in the concrete buildings. for production of cement considerable amount of fossil fuel and electrical energy is consumed. on the other hand for generating one tone of portland cement, nearly one ton of carbon dioxide is released. it shows that 7 percent of the total released carbon dioxide in the world relates to the cement industry. considering ecological issu...
ذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Knot Theory and Its Ramifications
سال: 2023
ISSN: ['1793-6527', '0218-2165']
DOI: https://doi.org/10.1142/s0218216523500311